Hypercube embedding heuristics: An evaluation
نویسندگان
چکیده
منابع مشابه
Fixed Hypercube Embedding
In this paper, we consider the problem of embedding a given graph into a fixed-size hypercube. This work is related to other recent research on hypercube embedding. In [1], Bhat describes an order IVl log2 IVI algorithm for testing whether a given graph G = (V, E) is exactly an n-cube. Deciding whether a graph has a distance-preserving embedding into a hypercube can be done in polynomial time [...
متن کاملEmbedding of Hypercube into Cylinder
Task mapping in modern high performance parallel computers can be modeled as a graph embedding problem, which simulates the mapping as embedding one graph into another and try to find the minimum wirelength for the mapping. Though embedding problems have been considered for several regular graphs, such as hypercubes into grids, binary trees into grids, et al, it is still an open problem for hyp...
متن کاملHypercube Embedding of Distances with Few Values Hypercube Embedding of Distances with Few Values
A distance d on a nite set V is hypercube embeddable if it can be isometrically embedded into the hypercube f0; 1g m for some m 1, i.e., if the elements i 2 V can be labeled by sets A i in such a way that d(i; j) = jA i 4A j j for all i; j 2 V. Testing whether a distance d is hypercube embeddable is an NP-complete problem, even if d is assumed to take its values in f2; 3; 4; 6g ((Chv80]). On th...
متن کاملEmbedding complete trees into the hypercube
We consider embeddings of the complete t-ary trees of depth k (denotation T k,t) as subgraphs into the hypercube of minimum dimension n. This n, denoted by dim(T k,t), is known if max{k, t} ≤ 2. First we study the next open case max{k, t} = 3. We improve the known upper bound dim(T k,3) ≤ 2k + 1 up to limk→∞ dim(T k,3)/k ≤ 5/3 and derive the asymptotic limt→∞ dim(T 3,t)/t = 227/120. As a co-res...
متن کاملCycles Embedding Problem in Hierarchical Hypercube Networks
The hierarchical hypercube network is suitable for massively parallel systems. The number of links in the hierarchical hypercube network forms a compromise between those of the hypercube and the cube-connected cycles. Recently, some interesting properties of the hierarchical hypercube network were investigated. Since the hierarchical hypercube is bipartite. A bipartite graph is bipancyclic if i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Parallel Programming
سال: 1989
ISSN: 0885-7458,1573-7640
DOI: 10.1007/bf01381720